Client-side Processing of GeoSPARQL Functions with Triple Pattern Fragments

نویسندگان

  • Christophe Debruyne
  • Eamonn Clinton
  • Declan O'Sullivan
چکیده

“Place” is an important concept providing a useful dimension to explore, align and analyze data on the Linked Data Web. Œough Linked Data datasets can use standardized geospatial predicates such as GeoSPARQL, access to SPARQL endpoints that supports these is not guaranteed. When not available, one needs to load the data into their own GeoSPARQL-enabled triplestores in order to avail of those predicates. Triple PaŠern Fragments (TPF) is a proposal to make clients more intelligent in processing RDF, thereby lessening the burden carried by servers. In this paper, we propose to extend TPF to support GeoSPARQL. Œe contribution is a minimal extension of the TPF client that does not rely on a spatial database such that the extension can be run from within a browser. Even though our approach will unlikely outperform GeoSPARQL-enabled triplestores in terms of query execution time, we demonstrate its feasibility by means of a couple of use cases using data provided by data.geohive.ie, an initiative to publish authoritative, highresolution geospatial data for Œe Republic of Ireland as Linked Data on the Web. Œis high-resolution data does cause a lot of network trac, but related work showed how extending the communication between a TPF client and server reduces the number HTTP calls and some network trac. Œe integration of our extension in one such optimization did reduce the overhead. We, however, decided to stick to our €rst implementation as it only extended the client in a minimal way. Future work includes investigating how our approach scales, and its usefulness of adding and using a spatial component to datasets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Querying Datasets on the Web with High Availability

As the Web of Data is growing at an ever increasing speed, the lack of reliable query solutions for live public data becomes apparent. sparql implementations have matured and deliver impressive performance for public sparql endpoints, yet poor availability—especially under high loads—prevents their use in real-world applications. We propose to tackle this availability problem by defining triple...

متن کامل

Reducing the Network Load of Triple Pattern Fragments by Supporting Bind Joins

The recently proposed Triple Pattern Fragment (TPF) interface aims at increasing the availability of Web-queryable RDF datasets [3]. To this end, the TPF proposal trades off an increased client-side query processing effort for a significant reduction of server load. However, an additional aspect of this trade-off is a very high network load. To mitigate this drawback we propose to extend the in...

متن کامل

Low-Cost Queryable Linked Data through Triple Pattern Fragments

For publishers of Linked Open Data, providing queryable access to their dataset is costly. Those that offer a public sparql endpoint often have to sacrifice high availability; others merely provide non-queryable means of access such as data dumps. We have developed a client-side query execution approach for which servers only need to provide a lightweight triple-pattern-based interface, enablin...

متن کامل

Opportunistic Linked Data Querying Through Approximate Membership Metadata

Between uri dereferencing and the sparql protocol lies a largely unexplored axis of possible interfaces to LinkedData, eachwith its own combination of trade-offs. One of these interfaces is Triple Pattern Fragments, which allows clients to execute sparql queries against low-cost servers, at the cost of higher bandwidth. Increasing a client’s efficiency means lowering the number of requests, whi...

متن کامل

Triple Pattern Fragments: A low-cost knowledge graph interface for the Web

Billions of Linked Data triples exist in thousands of RDF knowledge graphs on the Web, but few of those graphs can be queried live from Web applications. Only a limited number of knowledge graphs are available in a queryable interface, and existing interfaces can be expensive to host at high availability. To mitigate this shortage of live queryable Linked Data, we designed a low-cost Triple Pat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017